Fast Polynomial Segmentation of Digitized Curves
نویسندگان
چکیده
We propose a linear-time algorithm for curve segmentation which is based on constructive polynomial fitting. This work extends previous work on constructive fitting by taking the topological properties of a digitized curve into account. The algorithm uses uniform (or L∞) fitting and it works for segments of arbitrary thickness. We illustrate the algorithm with the segmentation of contours into straight and parabolic segments.
منابع مشابه
A fast near-optimal min-# polygonal approximation of digitized curves
We propose a fast near-optimal algorithm for solving the problem of min-# polygonal approximation of digitized curves. The algorithm consists of two steps. It first finds a reference approximation with minimum number of segments for a given error tolerance by using L error metrics. It then improves the quality of the approximation by a reduced-search dynamic programming with additive L2 error m...
متن کاملComparison of Diagnostic Value of Cast Analyzer X Iranian Software versus Curve Expert Software for Arch Form Construction based on Mathematical Models
Objective: For the assessment of primary arch form, different methods have been used including qualitative classifications, inter-canine and inter-molar widths and quantitative and numerical methods using mathematical models. The purpose of this study was to compare the validity and reliability of Cast Analyzer X Iranian software with those of Curve Expert Professional version 1.1 for arch fo...
متن کاملApplications of Digital Straight Segments to Economical Image Encoding
A new classification of digital curves into boundary curves and visual curves of different thickness is suggested. A fast algorithm for recognizing digital straight line segments in boundary curves is presented. The algorithm is applied to encode the boundaries of homogeneous regions in digitized images. The code is economical and enables an exact reconstruction of the original image.
متن کاملPiecewise Regression Mixture for Simultaneous Functional Data Clustering and Optimal Segmentation
This paper introduces a novel mixture model-based approach for simultaneous clustering and optimal segmentation of functional data which are curves presenting regime changes. The proposed model consists in a finite mixture of piecewise polynomial regression models. Each piecewise polynomial regression model is associated with a cluster, and within each cluster, each piecewise polynomial compone...
متن کاملAccelerating 'Intelligent Scissors' Using Slimmed Graphs
In this paper, we describe an acceleration technique for the semi-automatic image segmentation algorithm, intelligent scissors. Using intelligent scissors, user can accurately and interactively extract the object from the digitized image. However, the original algorithm suffers from slow performance when large images are treated. In practice, pixels within the non-edge regions are seldom involv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006